Multiple Boolean Relations
نویسندگان
چکیده
Flexibility in selecting the Boolean functions to implement a digital circuit has various forms which have been studied in the literature such as don't care conditions, Boolean relations, and synchronous recurrence equations. Each of these represents a particular degree of exibility that may be given in the description, inherent in the current representation, or derived from the surrounding environment. This exibility is used to nd an optimal implementation. In this paper, we propose a Multiple Boolean Relation (MBR) as a model that encompasses all degrees of freedom in choosing a set of Boolean functions to implement. This formulation uniies some of the recent work in logic synthesis, which has introduced new types of exibility. We give examples of synthesis problems in which Multiple Boolean Relations arise and are the only model that represents all the exibility available. We ooer algorithms for obtaining an optimal solution to an MBR.
منابع مشابه
The emergence of dynamic form through phase relations in dynamic systems
Gregory Bateson construes mental process as the flow and transforms of differences in a system. Stuart Kauffman uses NK Boolean systems to model the emergence of order in biological evolution. Because the Boolean base (0, 1) maps to Bateson’s idea of difference, we simulate Bateson’s epistemology with a Boolean system. Following Bateson’s idea that knowledge emerges from the relations among mul...
متن کاملComputing Relations in the Quantum Query Model
Query algorithms are used to compute mathematical functions. Classical version of this model is also known as decision trees. Quantum counterpart of decision trees – quantum query model – has been actively studied in recent years. Typically, query model is used to compute Boolean functions. In this paper, we consider computing mathematical relations instead of functions. A relation is a set of ...
متن کاملGalois correspondence for counting quantifiers
We introduce a new type of closure operator on the set of relations, max-implementation, and its weaker analog max-quantification. Then we show that approximation preserving reductions between counting constraint satisfaction problems (#CSPs) are preserved by these two types of closure operators. Together with some previous results this means that the approximation complexity of counting CSPs i...
متن کاملVisual Data Mining Using Monotone Boolean Functions
This paper describes a new technique for extracting patterns and relations visually from multidimensional binary data using monotone Boolean functions. Visual Data Mining (VDM) has shown benefits in many areas when used with numerical data, but that technique is less beneficial for binary data. This problem is especially challenging in medical applications tracked with binary symptoms. The prop...
متن کاملAlgebraic Attacks and Decomposition of Boolean Functions
Algebraic attacks on LFSR-based stream ciphers recover the secret key by solving an overdefined system of multivariate algebraic equations. They exploit multivariate relations involving key bits and output bits and become very efficient if such relations of low degrees may be found. Low degree relations have been shown to exist for several well known constructions of stream ciphers immune to al...
متن کامل